Design of quasisymplectic propagators for Langevin dynamics
نویسندگان
چکیده
منابع مشابه
Design of quasisymplectic propagators for Langevin dynamics.
A vector field splitting approach is discussed for the systematic derivation of numerical propagators for deterministic dynamics. Based on the formalism, a class of numerical integrators for Langevin dynamics are presented for single and multiple time step algorithms.
متن کاملLangevin stabilization of molecular-dynamics simulations of polymers by means of quasisymplectic algorithms.
Algorithms for the numerical integration of Langevin equations are compared in detail from the point of view of their accuracy, numerical efficiency, and stability to assess them as potential candidates for molecular-dynamics simulations of polymeric systems. Some algorithms are symplectic in the deterministic frictionless limit and prove to stabilize long time-step integrators. They are tested...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Dynamics of Langevin Simulations
This chapter reviews numerical simulations of quantum field theories based on stochastic quantization and the Langevin equation. The topics discussed include renormalization of finite stepsize algorithms, Fourier acceleration, and the relation of the Langevin equation to hybrid stochastic algorithms and hybrid Monte Carlo. Invited chapter to appear in the special supplement “Stochastic Quantiza...
متن کاملConsistency and fluctuations for stochastic gradient Langevin dynamics Consistency and fluctuations for stochastic gradient Langevin dynamics
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally expensive. Both the calculation of the acceptance probability and the creation of informed proposals usually require an iteration through the whole data set. The recently proposed stochastic gradient Langevin dynamics (SGLD) method circumvents this problem by generating proposals which are only ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2007
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.2753496